Ef"cient Optimal Recompression
نویسنده
چکیده
An ef"cient variant of an optimal algorithm is presented, which reorganizes data that has been compressed by some on-the-#y compression method, into a more compact form, without changing the decoding procedure. The algorithm accelerates and improves the space requirements of a known technique based on a reduction to a graph-theoretic problem, by reducing the size of the graph, without affecting the ef"ciency of the solution that is optimal for the given encodingmethod. The new method can effectively improve any static dictionary compression scheme using a static encoding method, and in particular some LZ77 variants.
منابع مشابه
k-Circulant Supersaturated Designs
A class of supersaturated designs called k-circulant designs is explored. These designs are constructed from cyclic generators by cycling k elements at a time. The class of designs includes many Es2-optimal designs, some of which are already known and some of which are more ef cient than known designs for model estimation under factor sparsity. Generators for the most ef cient designs are lis...
متن کاملEf"cient Stochastic Source Coding and an Application to a Bayesian Network Source Model
In this paper, we introduce a new algorithm called `bits-back coding' that makes stochastic source codes ef"cient. For a given one-to-many source code, we show that this algorithm can actually be more ef"cient than the algorithm that always picks the shortest codeword. Optimal ef"ciency is achieved when codewords are chosen according to the Boltzmann distribution based on the codeword lengths. ...
متن کاملPii: S0140-3664(00)00194-8
Ef®cient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the apropero planning of location areas. In this paper we de®ne and solve a version of the location area planning problem. Starting from a formal de®nition and an optimal formulation of the pr...
متن کاملValue at Risk in Portfolio Optimization: Properties and Computational Approach
Value at risk (VaR) is an important and widely used measure of the extent to which a given portfolio is subject to risk present in nancial markets. Considerable amount of research was dedicated during recent years to development of acceptable methods for evaluation of this risk measure. In this paper, we present a method of calculating the portfolio which gives the optimal VaR among those, whic...
متن کاملEf cient Multi-sink Relocation in Wireless Sensor Networks
The research community in wireless systems hold a keen interest in sensor networks issues. Sensor networks are dense wireless networks where information is gathered by sensor elements spread out in an interest area. Wireless sensors applications cover a large eld such as surveillance and security, target tracking, agriculture, health and military purposes. The main de ciency of sensors is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997